Constraint Based Subspace Clustering for High Dimensional Uncertain Data
نویسندگان
چکیده
منابع مشابه
Subspace Clustering for Uncertain Data
Analyzing uncertain databases is a challenge in data mining research. Usually, data mining methods rely on precise values. In scenarios where uncertain values occur, e.g. due to noisy sensor readings, these algorithms cannot deliver highquality patterns. Beside uncertainty, data mining methods face another problem: high dimensional data. For finding object groupings with locally relevant dimens...
متن کاملSubspace clustering using a symmetric low-rank representation
In this paper, we propose a low-rank representation with symmetric constraint (LRRSC) method for robust subspace clustering. Given a collection of data points approximately drawn from multiple subspaces, the proposed technique can simultaneously recover the dimension and members of each subspace. LRRSC extends the original low-rank representation algorithm by integrating a symmetric constraint ...
متن کاملSubspace Clustering via New Low-Rank Model with Discrete Group Structure Constraint
We propose a new subspace clustering model to segment data which is drawn from multiple linear or affine subspaces. Unlike the well-known sparse subspace clustering (SSC) and low-rank representation (LRR) which transfer the subspace clustering problem into two steps’ algorithm including building the affinity matrix and spectral clustering, our proposed model directly learns the different subspa...
متن کاملConstraint-Based Subspace Clustering
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes inadequate in high dimensional space. Another reason is that some dimensions are likely to be irrelevant or contain noisy data, thus hiding a possible clustering. To overcome these problems, subspace clustering techniq...
متن کاملMulti-View Subspace Clustering via Relaxed L1-Norm of Tensor Multi-Rank
In this paper, we address the multi-view subspace clustering problem. Our method utilize the circulant algebra for tensor, which is constructed by stacking the subspace representation matrices of different views and then shifting, to explore the high order correlations underlying multi-view data. By introducing a recently proposed tensor factorization, namely tensor-Singular Value Decomposition...
متن کامل